Multigrid Methods for Computational Acoustics on Vector and Parallel Computers
نویسندگان
چکیده
We consider the parabolic approximation to the three{dimensional Helmholtz equation for the acoustic pressure. The parabolic equation is semi{discretized in the range variable using an implicit scheme (e.g., Crank{Nicolson). This leads to a complex elliptic partial di erential equation that must be solved at each range step. We use a multigrid method to solve this partial di erential equation, which gives rise to matrices that are complex, symmetric (but non-Hermitean). In this sense, multigrid is an alternative to other approaches such as Krylov subspace methods and ADI. We present results for the Alliant FX2800 (a shared memorymachine based on i860 processors), and the Cray Y-MP. Our results demonstrate that multigrid maps e ectively to these supercomputer architectures, and that high performance can be achieved through the parallelizing compilers with relatively little user intervention.
منابع مشابه
Parallel Spatial Pyramid Match Kernel Algorithm for Object Recognition using a Cluster of Computers
This paper parallelizes the spatial pyramid match kernel (SPK) implementation. SPK is one of the most usable kernel methods, along with support vector machine classifier, with high accuracy in object recognition. MATLAB parallel computing toolbox has been used to parallelize SPK. In this implementation, MATLAB Message Passing Interface (MPI) functions and features included in the toolbox help u...
متن کاملAggregation-based algebraic multigrid on massively parallel computers
Many simulation codes in physics or engineering require the repeated solution of large linear systems stemming from (or closely related to) the discretization of scalar elliptic PDEs. For large 3D simulations, it is nowadays standard to use multigrid methods. These methods are indeed scalable in the sense that the overall computational work to obtain the solution up to a prescribed tolerance is...
متن کاملExposing Fine - Grained Parallelism in Algebraic Multigrid
Algebraic multigrid methods for large, sparse linear systems are a necessity in many computational simulations, yet parallel algorithms for such solvers are generally decomposed into coarse-grained tasks suitable for distributed computers with traditional processing cores. However, accelerating multigrid methods on massively parallel throughput-oriented processors, such as graphics processing u...
متن کاملParallel Multigrid Smoothing: Polynomial versus Gauss-seidel
Gauss-Seidel method is often the smoother of choice within multigrid applications. In the context of unstructured meshes, however, maintaining good parallel efficiency is difficult with multiplicative iterative methods such as Gauss-Seidel. This leads us to consider alternative smoothers. We discuss the computational advantages of polynomial smoothers within parallel multigrid algorithms for po...
متن کاملExposing Fine-Grained Parallelism in Algebraic Multigrid Methods
Algebraic multigrid methods for large, sparse linear systems are a necessity in many computational simulations, yet parallel algorithms for such solvers are generally decomposed into coarse-grained tasks suitable for distributed computers with traditional processing cores. However, accelerating multigrid on massively parallel throughput-oriented processors, such as the GPU, demands algorithms w...
متن کامل